Quantum algorithm

Results: 328



#Item
41Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments François Le Gall Department of Computer Science Graduate School of Information Science and Technology

Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments François Le Gall Department of Computer Science Graduate School of Information Science and Technology

Add to Reading List

Source URL: www.quantum-lab.org

Language: English - Date: 2015-02-25 18:15:25
    42Avinatan Hassidim Bar Ilan University Ramat GanIsrael. Email:  Email:  Email:  URL: http://www2.lns.mit.edu/∼avinatan

    Avinatan Hassidim Bar Ilan University Ramat GanIsrael. Email: Email: Email: URL: http://www2.lns.mit.edu/∼avinatan

    Add to Reading List

    Source URL: www2.lns.mit.edu

    Language: English - Date: 2012-03-21 03:37:00
    43An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups ∗ G´abor Ivanyos† Luc Sanselme‡

    An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups ∗ G´abor Ivanyos† Luc Sanselme‡

    Add to Reading List

    Source URL: www.liafa.univ-paris-diderot.fr

    Language: English - Date: 2010-12-13 11:02:49
      44Non-classical Correlations in the Quantum Search Algorithm Shantanav Chakraborty∗ and Satyabrata Adhikari† arXiv:1302.6005v1 [quant-ph] 25 FebIndian Institute of Technology Jodhpur, Jodhpur, India

      Non-classical Correlations in the Quantum Search Algorithm Shantanav Chakraborty∗ and Satyabrata Adhikari† arXiv:1302.6005v1 [quant-ph] 25 FebIndian Institute of Technology Jodhpur, Jodhpur, India

      Add to Reading List

      Source URL: arxiv.org

      Language: English - Date: 2013-02-25 20:14:08
        45Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 4: Hallgren’s algorithm for solving Pell’s equation In this and the next lecture, we will explore a final application of th

        Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 4: Hallgren’s algorithm for solving Pell’s equation In this and the next lecture, we will explore a final application of th

        Add to Reading List

        Source URL: www.math.uwaterloo.ca

        Language: English - Date: 2008-01-20 23:35:53
          46Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 2: The HSP and Shor’s algorithm for discrete log In this lecture we will discuss the discrete logarithm problem and its relev

          Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 2: The HSP and Shor’s algorithm for discrete log In this lecture we will discuss the discrete logarithm problem and its relev

          Add to Reading List

          Source URL: www.math.uwaterloo.ca

          Language: English - Date: 2008-02-20 16:14:23
            47Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 16: Quantum walk algorithm for element distinctness In this lecture we will discuss the algorithm that cemented the importance

            Quantum algorithms (CO 781, WinterProf. Andrew Childs, University of Waterloo LECTURE 16: Quantum walk algorithm for element distinctness In this lecture we will discuss the algorithm that cemented the importance

            Add to Reading List

            Source URL: www.math.uwaterloo.ca

            Language: English - Date: 2008-03-23 22:38:50
              48Quantum Computing and Cryptography Spring Semester 2011 Steve Vickers The University of Birmingham School of Computer Science

              Quantum Computing and Cryptography Spring Semester 2011 Steve Vickers The University of Birmingham School of Computer Science

              Add to Reading List

              Source URL: www.cs.bham.ac.uk

              Language: English - Date: 2011-03-23 04:16:10
              49High Performance Computing II  Lecture 13 Topic 3: Monte Carlo Simulation of Magnetic Materials (continued) The program ising.c implements a serial version of the Metropolis Monte Carlo algorithm applied to the 2-D Ising

              High Performance Computing II Lecture 13 Topic 3: Monte Carlo Simulation of Magnetic Materials (continued) The program ising.c implements a serial version of the Metropolis Monte Carlo algorithm applied to the 2-D Ising

              Add to Reading List

              Source URL: www.physics.buffalo.edu

              Language: English - Date: 2014-03-25 12:14:10
              50The bottleneck in the quantum factoring algorithm; i.e., the piece of the factoring algorithm that consumes the most time and space, is modular exponentiation.

              The bottleneck in the quantum factoring algorithm; i.e., the piece of the factoring algorithm that consumes the most time and space, is modular exponentiation.

              Add to Reading List

              Source URL: www.cs.bham.ac.uk

              - Date: 2011-03-23 04:14:00